Souslin’s conjecture as a problem on the real line

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A capitulation problem and Greenberg's conjecture on real quadratic fields

We give a sufficient condition in order that an ideal of a real quadratic field F capitulates in the cyclotomic Z3-extension of F by using a unit of an intermediate field. Moreover, we give new examples of F ’s for which Greenberg’s conjecture holds by calculating units of fields of degree 6, 18, 54

متن کامل

On the P-coverage Problem on the Real Line

In this paper we consider the p-coverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. Then we analyze how the structure of the optimal solution changes if the setup costs of the facilities are all decreased by the same amount. This result is used to develop a parametric ap...

متن کامل

POINTWISE PSEUDO-METRIC ON THE L-REAL LINE

In this paper, a pointwise pseudo-metric function on the L-realline is constructed. It is proved that the topology induced by this pointwisepseudo-metric is the usual topology.

متن کامل

The Jacobian Conjecture as a problem in combinatorics

The Jacobian Conjecture has been reduced to the symmetric homogeneous case. In this paper we give an inversion formula for the symmetric case and relate it to a combinatoric structure called the Grossman-Larson Algebra. We use these tools to prove the symmetric Jacobian Conjecture for the case F = X−H with H homogeneous and JH = 0. Other special results are also derived. We pose a combinatorial...

متن کامل

Towards on-line Ohba's conjecture

Ohba conjectured that every graph G with |V (G)|6 2χ(G)+1 has its choice number equal its chromatic number. The on-line choice number of a graph is a variation of the choice number defined through a two person game, and is always at least as large as its choice number. Based on the result that for k > 3, the complete multipartite graph K2?(k−1),3 is not on-line k-choosable, the on-line version ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1972

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1972.43.277